A theorem equivalent to the Brouwer fixed point theorem
نویسندگان
چکیده
منابع مشابه
The Brouwer Fixed Point Theorem for Intervals1
(1) If a≤ c and d ≤ b, then [c,d]⊆ [a,b]. (2) If a≤ c and b≤ d and c≤ b, then [a,b]∪ [c,d] = [a,d]. (3) If a≤ c and b≤ d and c≤ b, then [a,b]∩ [c,d] = [c,b]. (4) For every subset A of R1 such that A = [a,b] holds A is closed. (5) If a≤ b, then [a, b]T is a closed subspace of R1. (6) If a≤ c and d ≤ b and c≤ d, then [c, d]T is a closed subspace of [a, b]T. (7) If a≤ c and b≤ d and c≤ b, then [a,...
متن کاملBrouwer Fixed Point Theorem for Simplexes
In this article we prove the Brouwer fixed point theorem for an arbitrary simplex which is the convex hull of its n + 1 affinely indepedent vertices of E. First we introduce the Lebesgue number, which for an arbitrary open cover of a compact metric space M is a positive real number so that any ball of about such radius must be completely contained in a member of the cover. Then we introduce the...
متن کاملA Combinatorial Approach to the Brouwer Fixed Point Theorem
The Brouwer Fixed Point Theorem states that any continuous mapping from a closed ball in Euclidean space to itself has at least one fixed point. This theorem has a wide variety of applications in areas such as differential equations, economics, and game theory. Although this is fundamentally an analytic and topological statement, there exists an elegant combinatorial proof using Sperner’s Lemma...
متن کاملSpherical Designs via Brouwer Fixed Point Theorem
For each N ≥ cdn 2d(d+1) d+2 we prove the existence of a spherical ndesign on Sd consisting of N points, where cd is a constant depending only on d.
متن کاملComputable counter-examples to the Brouwer fixed-point theorem
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and noncomputable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for finding the fixed point in general by giving an example of a computable function which does not fix any computable point. Research in reverse mathematics has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1971
ISSN: 0386-2194
DOI: 10.3792/pja/1195519932